Correspondence between steganographic protocols and error correcting codes

A Novel Steganographic Protocol from Error-correcting Codes

The idea of ”Matrix encoding” was introduced in steganography by Crandall in 1998 [6]. The implementation was then proposed by Westfeld with steganography algorithm F5 [1]. The objective is to transmit a message within an image via the modified image, but with the constraint of minimizing the number of coefficients of the image changed. In this paper, new construction of protocol steganography ...

Synchronizable Error-Correcting Codes

A new technique for correcting synchronization errors in the transmission of discrete-symbol information is developed. The technique can be applied to any t-additive-error-correcting Bose-Chaudhuri-Hocquenghem code, to provide protection against synchronization errors. The synchronization error is corrected at the first complete received word after the word containing the synchronization error,...

Parallel error correcting codes

Error-Correcting Codes

Transmission of information takes place over “noisy” signals. This is the case in satellite transmissions and storing data. For this reason, it is useful to encode information so that errors can be detected and corrected. For our purposes, we will assume all information to be encoded constists of words of fixed length k using symbols from a fixed alphabet, and all encoded messages are divided i...

Error Correcting Codes

Error correcting codes make possible much of digital technology, from modems to cell phones to compact disk players. The problem is to send a message across a noisy channel with perfect fidelity, or at least with as much fidelity as possible. Below we will describe the theory of these codes. It is based on some ideas from “modern algebra,” including finite number systems called rings and fields...